Path-following Methods for a Class of Constrained Minimization Problems in Function Space

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Path-following Methods for a Class of Constrained Minimization Problems in Function Space

Path-following methods for primal-dual active set strategies requiring a regularization parameter are introduced. Existence of a path and its differentiability properties are analyzed. Monotonicity and convexity of the primal-dual path value function are investigated. Both feasible and infeasible approximations are considered. Numerical path following strategies are developed and their efficien...

متن کامل

A Class of Accelerated Conjugate Direction Methods for Linearly Constrained Minimization Problems

A class of algorithms are described for the minimization of a function of n variables subject to linear inequality constraints. Under weak conditions convergence to a stationary point is demonstrated. The method uses a mixture of conjugate direction constructing and accelerating steps. Any mixture, for example alternation, may be used provided that the subsequence of conjugate direction constru...

متن کامل

An Inexact Proximal Path-Following Algorithm for Constrained Convex Minimization

Many scientific and engineering applications feature large-scale non-smooth convex minimization problems over convex sets. In this paper, we address an important instance of this broad class where we assume that the non-smooth objective is equipped with a tractable proximity operator and that the convex constraints afford a self-concordant barrier. We provide a new joint treatment of proximal a...

متن کامل

Truncated Nonsmooth Newton Multigrid Methods for Simplex-Constrained Minimization Problems

We present a multigrid method for the minimization of strongly convex functionals defined on a finite product of simplices. Such problems result, for example, from the discretization of multi-component phase-field problems. Our algorithm is globally convergent, requires no regularization parameters, and achieves multigrid convergence rates. We present numerical results for the vector-valued All...

متن کامل

Relaxed Viscosity Approximation Methods with Regularization for Constrained Minimization Problems

1 Department of Mathematics, Shanghai Normal University, Scientific Computing Key Laboratory of Shanghai Universities, Shanghai 200234, China 2Department of Applied Mathematics, National Sun Yat-sen University, Kaohsiung 80424, Taiwan 3Department of Mathematics, King Abdulaziz University, P.O. Box 80203, Jeddah 21589, Saudi Arabia 4Center for Fundamental Science, Kaohsiung Medical University, K...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Optimization

سال: 2006

ISSN: 1052-6234,1095-7189

DOI: 10.1137/040611598